package com.Jancode.leetcode;

import com.Jancode.leetcode.util.TreeNode;

public class BTMerge {
    class Solution {
        // merge the tree 2 into the tree 1
        public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
            if(root1 == null) return root2;
            if(root2 == null) return root1;

            TreeNode root = root1;

            root.val = root1.val + root2.val;
            root.left = mergeTrees(root1.left, root2.left);
            root.right = mergeTrees(root1.right, root2.right);

            return root;
        }
    }
}
